Some extremal properties of the Fibonacci word
نویسنده
چکیده
We prove that the Fibonacci word f satisfies among all characteristic Sturmian words, three interesting extremal properties. The first concerns the length and the second the minimal period of its palindromic prefixes. Each of these two properties characterizes f up to a renaming of its letters. A third property concerns the number of occurrences of the letter b in its palindromic prefixes. It characterizes uniquely f among all characteristic Sturmian words having the prefix abaa.
منابع مشابه
On extremal properties of the Fibonacci word
We survey several quantitative problems on infinite words related to repetitions, recurrence, and palindromes, for which the Fibonacci word often exhibits extremal behaviour. Résumé. Nous considérons plusieurs problèmes quantitatifs sur les mots infinis, faisant intervenir les répétitions fractionnaires, la notion de récurrence et les palindromes, pour lesquels le mot de Fibonacci a souvent des...
متن کاملSome Properties of the Singular Words of the Fibonacci Word
The combinatorial properties of the Fibonacci innnite word are of great interest in some aspects of mathematics and physics, such as number theory, fractal geometry, formal language, computational complexity , quasicrystals etc. In this note, we introduce the singular words of the Fibonacci innnite word and discuss their properties. We establish two decompositions of the Fibonacci word in singu...
متن کاملA generalization of the Fibonacci word fractal and the Fibonacci snowflake
In this paper we introduce a family of infinite words that generalize the Fibonacci word and we study their combinatorial properties. We associate with this family of words a family of curves that are like the Fibonacci word fractal and reveal some fractal features. Finally, we describe an infinite family of polyominoes stems from the generalized Fibonacci words and we study some of their geome...
متن کاملProperties of the Extremal Infinite Smooth Words
Smooth words are connected to the Kolakoski sequence. We construct the maximal and the minimal infinite smooth words, with respect to the lexicographical order. The naive algorithm generating them is improved by using a reduction of the De Bruijn graph of their factors. We also study their Lyndon factorizations. Finally, we show that the minimal smooth word over the alphabet {1, 3} belongs to t...
متن کاملDecision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties
We continue our study of the class of Fibonacci-automatic words. These are infinite words whose nth term is defined in terms of a finite-state function of the Fibonacci representation of n. In this paper, we show how enumeration questions (such as counting the number of squares of length n in the Fibonacci word) can be decided purely mechanically, using a decision procedure. We reprove some kno...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJAC
دوره 23 شماره
صفحات -
تاریخ انتشار 2013